/
Your selections:
Milling a graph with turn costs: a parameterized complexity perspective
- Fellows, Mike, Giannopoulos, Panos, Knauer, Christian, Paul, Christophe, Rosamond, Frances, Whitesides, Sue, Yu, Nathan
On complexity of lobbying in multiple referenda
- Christian, Robin, Fellows, Mike, Rosamond, Frances, Slinko, Arkadii
Tight lower bounds for certain parameterized NP-hard problems
- Chen, Jianer, Chor, Benny, Fellows, Mike, Huang, Xiuzhen, Juedes, David, Kanj, Iyad A, Xia, Ge
Linear kernels in linear time, or how to save k colours in O(n2) steps
- Fellows, Mike, Juedes, David, Chor, Benny
Are you sure you would like to clear your session, including search history and login status?